Preemptive Ensemble Motion Planning on a Tree
نویسندگان
چکیده
منابع مشابه
Preemptive Ensemble Motion Planning on a Tree
Consider the problem of finding a minimum cost tour to transport a set of objects uetween the vertices of a tree by a vehicle that travels along the edges of the tree. The vehicle can carry only one object at a time, and it starts and finishes at the same vertex of the tree. It is shown that if objects can ue dropped at intermediate vertices along its route and picked up later, then the prol>le...
متن کاملNonpreemptive Ensemble Motion Planning on a Tree
Consider the problem of transporting a set of objects between the vertices of a tree by a vehicle that travels along the edges of the tree. The vehicle can carry only one object at a time, and it starts and finishes at the same vertex of the tree. It is shown that if each object must be carried directly from its initial vertex to its destina.tion then finding a minimum cost transportation is NP...
متن کاملThe preemptive swapping problem on a tree
This article considers the swapping problem on a tree. In this problem at most one object of some type is available at each vertex, and each vertex also requests at most one object of a given type. The total demand and the total supply of each object type are identical. The problem is to determine a minimum cost routing plan starting and ending at a prespecified vertex which is the depot, for a...
متن کاملMotion planning under bounded uncertainty using ensemble control
This paper considers the problem of motion planning for a nonholonomic unicycle despite uncertainty that scales both the forward speed and the turning rate by an unknown but bounded constant. We model the unicycle as an ensemble control system, show that the position of this ensemble is controllable, and derive motion planning algorithms to steer this position between a given start and goal. We...
متن کاملMotion Planning on a Graph
In this paper, all graphs are simple, i.e., without self-loops or parallel edges, unless otherwise stated. A weighted graph G is a triple (V (G), E(G), costG), where V (G) is the vertex set of G, E(G) is the edge set of G, and costG is a function from E(G) to nonnegative reals, called the cost function of G. For each edge e of G, we call costG(e) the cost of e. Let G be a (weighted) graph. For ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Computing
سال: 1992
ISSN: 0097-5397,1095-7111
DOI: 10.1137/0221066